Stirling Permutations, Cycle Structure of Permutations and Perfect Matchings
نویسندگان
چکیده
In this paper we provide constructive proofs that the following three statistics are equidistributed: the number of ascent plateaus of Stirling permutations of order n, a weighted variant of the number of excedances in permutations of length n and the number of blocks with even maximal elements in perfect matchings of the set {1, 2, 3, . . . , 2n}.
منابع مشابه
Eulerian Polynomials, Stirling Permutations of the Second Kind and Perfect Matchings
In this paper, we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the second kind by their cycle ascent plateaus, fixed points and cycles. Moreover, we get an expansion of the ordinary derangement polynomials in terms of the Stirling derangement polynomials. Finally, we present constructive proofs of a kind of combinatorial expansions of the ...
متن کاملThe Cycle Descent Statistic on Permutations
In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.
متن کاملCycles and sorting index for matchings and restricted permutations
We prove that the Mahonian-Stirling pairs of permutation statistics (sor, cyc) and (inv, rlmin) are equidistributed on the set of permutations that correspond to arrangements of n non-atacking rooks on a fixed Ferrers board with n rows and n columns. The proofs are combinatorial and use bijections between matchings and Dyck paths and a new statistic, sorting index for matchings, that we define....
متن کاملA Colorful Involution for the Generating Function for Signed Stirling Numbers of the First Kind
We show how the generating function for signed Stirling numbers of the first kind can be proved using the involution principle and a natural combinatorial interpretation based on cycle-colored permuations. We seek an involution-based proof of the generating function for signed Stirling numbers of the first kind, written here as ∑ k (−1)c(n, k)x = (−1)(x)(x− 1) · · · (x− n+ 1) where c(n, k) is t...
متن کاملEnumeration formulæ for pattern restricted Stirling permutations
We classify k-Stirling permutations avoiding a set of ordered patterns of length three according to Wilf-equivalence. Moreover, we derive enumeration formulæ for all of the classes using a variety of techniques such as the kernel method, a bijection related to a classical result of Simion and Schmidt, and also structural decompositions of k-Stirling permutations via the so-called block decompos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015